A Bottom-Up Implementation of Path-Relinking for Phylogenetic Reconstruction Applied to Maximum Parsimony

In this article we describe a bottom-up implementation of Path-Relinking for Phylogenetic Trees in the context of the resolution of the Maximum Parsimony problem with Fitch optimality criterion. This bottom-up implementation is compared to two versions of an existing top-down implementation. We show that our implementation is more efficient, more interesting to compare trees and to give an estimation of the distance between two trees in terms of the number of transformation

Tactical Supply Chain Distribution Planning In The Telecommunications Service Industry

Supply chains are ubiquitous across industries and a considerable e ort has been invested in supply chain management techniques over the last two decades. In equipment-intensive service industries, it often involves repair operations. In this context, tactical inventory planning is concerned with optimally planning supplies and repairs based on demand forecasts and in face of con icting business objectives. It is based on a case study in the telecommunications sector where large quantities and varieties of spare parts are required for service maintenance and repair tasks at customer premises or company exchanges. Speci cally, we consider a multi-echelon spare parts supply chain and tackle the problem of determining an optimal stock distribution plan given a demand forecast. We propose a mixed integer programming and a metaheuristic approach to this problem. The model is open to a variety of network topologies, site functions and transfer policies. It also accommodates multiple objectives by the means of a weighted cost function. We report experiments on pseudo-random instances designed to evaluate plan quality and impact of cost weightings. In particular, we show how appropriate weightings allow to emulate common planning strategies (e.g., just-in-time replenishment, minimal repair). We also assess plan quality and system performance against di erent classes of pseudo-random instances featuring different volume and distribution of stock and demand